-
1 variant theorem
Большой англо-русский и русско-английский словарь > variant theorem
-
2 variant theorem
Математика: теорема о варианте -
3 variant theorem
мат. -
4 theorem
- analytical hierarchy theorem - arithmetical hierarchy theorem - closed range theorem - formally provable theorem - implicit function theorem - initial value theorem - integral representation theorem - local limit theorem - maximal ergodic theorem - mean value theorem - normal form theorem - ratio limit theorem - rational root theorem - second mean value theorem - theorem of consistency proofs - theorem of corresponding states - three line theorem - three series theorem - uniform convergence theorem - uniform ergodic theorem - uniform mean value theoremtheorem implies — из теоремы следует, что…
-
5 теорема о варианте
Большой англо-русский и русско-английский словарь > теорема о варианте
-
6 proof
1) доказательство; обоснование; подтверждение2) полигр. корректура, пробный оттиск4) проверка; испытание; проба || проверять; испытывать; опробовать5) безопасный; защищённый6) обеспечивать непроницаемость; герметизировать•proof against — устойчивый к воздействию (какого-л. фактора)
proof by contradiction — мат. доказательство от противного
proof by induction — мат. доказательство по индукции
proof by matrices — мат. доказательство с помощью матриц
proof in outline — набросок [схема] доказательства;
this completes the proof — это завершает доказательство; на этом доказательство заканчивается
- strong proofto give a proof — матем. дать доказательство
См. также в других словарях:
Mean value theorem — For the theorem in harmonic function theory, see Harmonic function#Mean value property. Topics in Calculus Fundamental theorem Limits of functions Continuity Mean value theorem Differential calculus Derivative Change of variables … Wikipedia
Stinespring factorization theorem — In mathematics, Stinespring s dilation theorem, also called Stinespring s factorization theorem, is a result from operator theory that represents any completely positive map on a C* algebra as a composition of two completely positive maps each of … Wikipedia
Central limit theorem — This figure demonstrates the central limit theorem. The sample means are generated using a random number generator, which draws numbers between 1 and 100 from a uniform probability distribution. It illustrates that increasing sample sizes result… … Wikipedia
Gödel's completeness theorem — is a fundamental theorem in mathematical logic that establishes a correspondence between semantic truth and syntactic provability in first order logic. It was first proved by Kurt Gödel in 1929. A first order formula is called logically valid if… … Wikipedia
Binomial theorem — The binomial coefficients appear as the entries of Pascal s triangle. In elementary algebra, the binomial theorem describes the algebraic expansion of powers of a binomial. According to the theorem, it is possible to expand the power… … Wikipedia
Prime number theorem — PNT redirects here. For other uses, see PNT (disambiguation). In number theory, the prime number theorem (PNT) describes the asymptotic distribution of the prime numbers. The prime number theorem gives a general description of how the primes are… … Wikipedia
Divergence theorem — Topics in Calculus Fundamental theorem Limits of functions Continuity Mean value theorem Differential calculus Derivative Change of variables Implicit differentiation Taylor s theorem Related rates … Wikipedia
Circle packing theorem — Example of the circle packing theorem on K5, the complete graph on five vertices, minus one edge. The circle packing theorem (also known as the Koebe–Andreev–Thurston theorem) describes the possible tangency relations between circles in the plane … Wikipedia
Poincaré–Birkhoff–Witt theorem — In the theory of Lie algebras, the Poincaré–Birkhoff–Witt theorem (Poincaré (1900), G. D. Birkhoff (1937), Witt (1937); frequently contracted to PBW theorem) is a result giving an explicit description of the universal enveloping algebra of a Lie… … Wikipedia
Fermat's little theorem — (not to be confused with Fermat s last theorem) states that if p is a prime number, then for any integer a , a^p a will be evenly divisible by p . This can be expressed in the notation of modular arithmetic as follows::a^p equiv a pmod{p},!A… … Wikipedia
Fubini's theorem — In mathematical analysis, Fubini s theorem, named after Guido Fubini, states that if:int {A imes B} |f(x,y)|,d(x,y) … Wikipedia